Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
نویسندگان
چکیده
We show lower bounds of Ω( √ n) and Ω(n) on the randomized and quantum communication complexity, respectively, of all nvariable read-once Boolean formulas. Our results complement the recent lower bound ofΩ(n/8) by Leonardos and Saks [LS09] andΩ(n/2 log ) by Jayram, Kopparty and Raghavendra [JKR09] for randomized communication complexity of read-once Boolean formulas with depth d. We obtain our result by “embedding” either the Disjointness problem or its complement in any given read-once Boolean formula.
منابع مشابه
Information Theory Methods in Communication Complexity
OF THE DISSERTATION Information theory methods in communication complexity by Nikolaos Leonardos Dissertation Director: Michael Saks This dissertation is concerned with the application of notions and methods from the field of information theory to the field of communication complexity. It consists of two main parts. In the first part of the dissertation, we prove lower bounds on the randomized ...
متن کاملMultiparty Communication Complexity of AC
We prove n lower bounds on the multiparty communication complexity of AC functions in the number-on-forehead (NOF) model for up to Θ(logn) players. These are the first lower bounds for any AC function for ω(log logn) players. In particular we show that there are families of depth 3 read-once AC formulas having k-player randomized multiparty NOF communication complexity n/2. We show similar lowe...
متن کاملHardness Amplification and the Approximate Degree of Constant-Depth Circuits
We establish a generic form of hardness amplification for the approximability of constantdepth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to within constant error in a certain onesided sense, then an OR of disjoint copies of that circuit cannot be pointwise approximated even with very high error. As...
متن کاملOn the Communication Complexity of Read-Once AC Formulae
We study the 2-party randomized communication complexity of read-once AC formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication complexity of the function f (x, y) = T (x◦y) is Ω(n/4) where (x◦y)i is defined so that the resulting tree also has alternating levels of AND and OR gates. For each bit of x, y, the operation ◦ is either AND or OR depending on t...
متن کاملThe Quantum Query Complexity of Read-Many Formulas
The quantum query complexity of evaluating any read-once formula with n black-box input bits is Θ( √ n). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algor...
متن کامل